On Zero-Delay Source-Channel Coding
نویسندگان
چکیده
منابع مشابه
Universal Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...
متن کاملOn Competitive Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. For the case where the channel is a DMC we construct an implementable sche...
متن کاملZero-error Source-channel Coding with Entanglement
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice’s input while using the channel as little as possible. In the zero-error regime, the optimal rates of source codes and channel codes are given b...
متن کاملZero-Delay Joint Source-Channel Coding for a Multivariate Gaussian on a Gaussian MAC
In this paper, communication of a Multivariate Gaussian over a Gaussian Multiple Access Channel is studied. Distributed zero-delay joint source-channel coding (JSCC) solutions to the problem are given. Both nonlinear and linear approaches are discussed. The performance upper bound (signalto-distortion ratio) for arbitrary code length is also derived and Zero-delay cooperative JSCC is briefly ad...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2361532